Subdirect Unions in Universal Algebra
نویسنده
چکیده
The number of distinct operations (that is, the range of the variable a) may be infinite, but for our main result (Theorem 2), we shall require every n(a) to be finite—that is, it will concern algebras with finitary operations. The concepts of subalgebra, congruence relation on an algebra, homomorphism of one algebra A onto (or into) another algebra with the same operations, and of the direct union AiX • • • XAr of any finite or infinite class of algebras with the same operations have been developed elsewhere. More or less trivial arguments establish a manyone correspondence between the congruence relations 0i on an algebra A and the homomorphic images Hi — 6i(A) of the algebra (isomorphic images being identified); moreover the congruence relations on A form a lattice (the structure lattice of A). In this lattice, the equality relation will be denoted 0 ; all other congruence relations will be called proper. More or less trivial arguments also show (cf. Lattice theory, Theorem 3.20) that the isomorphic representations of any algebra A as a subdirect union, or subalgebra S^HiX • • • XHr of a direct union of algebras Hi, correspond essentially one-one to the sets of congruence relations 0i on A such that A0t=O. In fact, given such a set of Oi, the correspondence
منابع مشابه
On residuated lattices with universal quantifiers
We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...
متن کاملCategorical Abstract Algebraic Logic: Subdirect Representation for Classes of Structure Systems
The notion of subdirect irreducibility in the context of languages without equality, as presented by Elgueta, is extended in order to obtain subdirect representation theorems for abstract and reduced classes of structure systems. Structure systems serve as models of firstorder theories but, rather than having universal algebras as their algebraic reducts, they have algebraic systems in the sens...
متن کاملEffective Subdirect Decomposition: A Case Study
Certainly, one of the most fundamental early results in universal algebra is Birkhoff’s 1944 decomposition theorem which states that every (universal) algebra d may be represented as a subdirect product of subdirectly irreducible algebras of the same type. It is clear that for d finite such decompositions may be obtained effectively, at least in principle. At first sight, therefore, one might b...
متن کاملCategorical Abstract Algebraic Logic: Subdirect Representation of Pofunctors
Pałasińska and Pigozzi developed a theory of partially ordered varieties and quasi-varieties of algebras with the goal of addressing issues pertaining to the theory of algebraizability of logics involving an abstract form of the connective of logical implication. Following their lead, the author has abstracted the theory to cover the case of algebraic systems, systems that replace algebras in t...
متن کاملCellular Automata as Algebraic Systems
Infinite cellular automata have been studied mostly using empirical and sta tistical techniques, with some combinatorial analysis. Here we show how concepts of universal algebra such as subdirect decomposition and chains of varieties can be applied to their study. Cellular automata with ultimately periodic behavior are shown to correspond to varieties of groupoids. Relat ionships between these ...
متن کامل